31 research outputs found

    The PROOF Distributed Parallel Analysis Framework based on ROOT

    Full text link
    The development of the Parallel ROOT Facility, PROOF, enables a physicist to analyze and understand much larger data sets on a shorter time scale. It makes use of the inherent parallelism in event data and implements an architecture that optimizes I/O and CPU utilization in heterogeneous clusters with distributed storage. The system provides transparent and interactive access to gigabytes today. Being part of the ROOT framework PROOF inherits the benefits of a performant object storage system and a wealth of statistical and visualization tools. This paper describes the key principles of the PROOF architecture and the implementation of the system. We will illustrate its features using a simple example and present measurements of the scalability of the system. Finally we will discuss how PROOF can be interfaced and make use of the different Grid solutions.Comment: Talk from the 2003 Computing in High Energy and Nuclear Physics (CHEP03), La Jolla, CA, USA, March 2003, 5 pages, LaTeX, 4 eps figures. PSN TULT00

    ROOT - A C++ Framework for Petabyte Data Storage, Statistical Analysis and Visualization

    Full text link
    ROOT is an object-oriented C++ framework conceived in the high-energy physics (HEP) community, designed for storing and analyzing petabytes of data in an efficient way. Any instance of a C++ class can be stored into a ROOT file in a machine-independent compressed binary format. In ROOT the TTree object container is optimized for statistical data analysis over very large data sets by using vertical data storage techniques. These containers can span a large number of files on local disks, the web, or a number of different shared file systems. In order to analyze this data, the user can chose out of a wide set of mathematical and statistical functions, including linear algebra classes, numerical algorithms such as integration and minimization, and various methods for performing regression analysis (fitting). In particular, ROOT offers packages for complex data modeling and fitting, as well as multivariate classification based on machine learning techniques. A central piece in these analysis tools are the histogram classes which provide binning of one- and multi-dimensional data. Results can be saved in high-quality graphical formats like Postscript and PDF or in bitmap formats like JPG or GIF. The result can also be stored into ROOT macros that allow a full recreation and rework of the graphics. Users typically create their analysis macros step by step, making use of the interactive C++ interpreter CINT, while running over small data samples. Once the development is finished, they can run these macros at full compiled speed over large data sets, using on-the-fly compilation, or by creating a stand-alone batch program. Finally, if processing farms are available, the user can reduce the execution time of intrinsically parallel tasks - e.g. data mining in HEP - by using PROOF, which will take care of optimally distributing the work over the available resources in a transparent way

    System size dependence of cluster properties from two-particle angular correlations in Cu+Cu and Au+Au collisions at sNN\sqrt{s_{_{NN}}} = 200 GeV

    Full text link
    We present results on two-particle angular correlations in Cu+Cu and Au+Au collisions at a center of mass energy per nucleon pair of 200 GeV over a broad range of pseudorapidity (η\eta) and azimuthal angle (ϕ\phi) as a function of collision centrality. The PHOBOS detector at RHIC has a uniquely-large angular coverage for inclusive charged particles, which allows for the study of correlations on both long- and short-range scales. A complex two-dimensional correlation structure in Δη\Delta \eta and Δϕ\Delta \phi emerges, which is interpreted in the context of a cluster model. The effective cluster size and decay width are extracted from the two-particle pseudorapidity correlation functions. The effective cluster size found in semi-central Cu+Cu and Au+Au collisions is comparable to that found in proton-proton collisions but a non-trivial decrease of the size with increasing centrality is observed. Moreover, a comparison between results from Cu+Cu and Au+Au collisions shows an interesting scaling of the effective cluster size with the measured fraction of total cross section (which is related to the ratio of the impact parameter to the nuclear radius, b/2Rb/2R), suggesting a geometric origin. Further analysis for pairs from restricted azimuthal regions shows that the effective cluster size at Δϕ∼180∘\Delta\phi \sim 180^{\circ} drops more rapidly toward central collisions than the size at Δϕ∼0∘\Delta\phi \sim 0^{\circ}. The effect of limited η\eta acceptance on the cluster parameters is also addressed, and a correction is applied to present cluster parameters for full η\eta coverage, leading to much larger effective cluster sizes and widths than previously noted in the literature. These results should provide insight into the hot and dense medium created in heavy ion collisions.Comment: 9 pages, 8 figures, Published in Phys. Rev.

    Nucleon-Gold Collisions at 200 AGeV Using Tagged d+Au Interactions in PHOBOS

    Get PDF
    Forward calorimetry in the PHOBOS detector has been used to study charged hadron production in d+Au, p+Au and n+Au collisions at sqrt(s_nn) = 200 GeV. The forward proton calorimeter detectors are described and a procedure for determining collision centrality with these detectors is detailed. The deposition of energy by deuteron spectator nucleons in the forward calorimeters is used to identify p+Au and n+Au collisions in the data. A weighted combination of the yield of p+Au and n+Au is constructed to build a reference for Au+Au collisions that better matches the isospin composition of the gold nucleus. The p_T and centrality dependence of the yield of this improved reference system is found to match that of d+Au. The shape of the charged particle transverse momentum distribution is observed to extrapolate smoothly from pbar+p to central d+Au as a function of the charged particle pseudorapidity density. The asymmetry of positively- and negatively-charged hadron production in p+Au is compared to that of n+Au. No significant asymmetry is observed at mid-rapidity. These studies augment recent results from experiments at the LHC and RHIC facilities to give a more complete description of particle production in p+A and d+A collisions, essential for the understanding the medium produced in high energy nucleus-nucleus collisions.Comment: 17 pages, 18 figure

    Participant and spectator scaling of spectator fragments in Au + Au and Cu + Cu collisions at √sNN = 19.6 and 22.4 GeV

    Get PDF
    Spectator fragments resulting from relativistic heavy ion collisions, consisting of single protons and neutrons along with groups of stable nuclear fragments up to nitrogen (Z=7), are measured in PHOBOS. These fragments are observed in Au+Au (√sNN =19.6GeV) and Cu+Cu (22.4 GeV) collisions at high pseudorapidity (η). The dominant multiply-charged fragment is the tightly bound helium (α), with lithium, beryllium, and boron all clearly seen as a function of collision centrality and pseudorapidity. We observe that in Cu+Cu collisions, it becomes much more favorable for the α fragments to be released than lithium. The yields of fragments approximately scale with the number of spectator nucleons, independent of the colliding ion. The shapes of the pseudorapidity distributions of fragments indicate that the average deflection of the fragments away from the beam direction increases for more central collisions. A detailed comparison of the shapes for α and lithium fragments indicates that the centrality dependence of the deflections favors a scaling with the number of participants in the collision.United States. Department of Energy (Grant DE-AC02-98CH10886)United States. Department of Energy (Grant DE-FG02-93ER40802)United States. Department of Energy (Grant DE-FG02-94ER40818)United States. Department of Energy (Grant DE-FG02-94ER40865)United States. Department of Energy (Grant DE-FG02- 99ER41099)United States. Department of Energy (Grant DE-AC02-06CH11357)National Science Foundation (U.S.) (Grant 9603486)National Science Foundation (U.S.) (Grant 0072204)National Science Foundation (U.S.) (Grant 0245011

    Mechanisms for effective caching in the Globe location service

    Full text link

    Supporting Effective Caching in a Wide-Area Location Service

    No full text
    Globe is a wide-area distributed system in which objects are allowed to migrate between any machines, at any time. To support tracking and location of objects, we use a worldwide distributed location service. This service is implemented as a hierarchical search tree. Normally, an object registers its current location by storing an address in a nearby leaf node of the tree. A path of forwarding pointers from the root of the tree to that leaf node is then established. In other words, the root knows about all objects. Update operations can be relatively costly if many forwarding pointers need to be changed when moving to a new location. Likewise, lookup operations may often need to go to the root of the tree to locate an object. In this research, we investigate how the update and lookup operations for mobile objects can be optimized. Location caches and a dynamicallycomputed "stable" location to registered mobile objects are two aspects of this optimization. 1 Introduction In recent ..

    Mechanisms for effective caching in the Globe location service

    Get PDF
    Globe is a wide-area distributed system that supports mobile objects. To track and locate objects, we use a worldwide distributed location service, implemented as a search tree. An object registers its current position by storing its address in a nearby leaf node of the tree. This knowledge propagates up to the top of the tree, so every object can be found from the root. Remote objects can cache the location of an object. However, if the object moves, the cache entry is no longer valid. In this paper, we show how caching can be made to work eectively even in the presence of mobile objects. 1 Introduction In recent years, the interest in worldwide mobility and ubiquitous computing has increased considerably. The constantly growing number of mobile phones is one visible aspect of this interest; the common use of laptop computers and handheld devices is another. Furthermore, portable hardware increasingly oers Internet connectivity. For example, it is possible to read one's e-mail fro..
    corecore